A Polynomial-Bisimilar Normalization for Reset Petri Nets

Reset Petri nets extend Petri nets by allowing transitions to empty places, in addition with the usual adding of removing of constants. A Reset Petri net is normalized if the ow function over the Petri arcs (labeled with integers) and the initial state are valuated into f0; 1g. In this paper, we give an eecient method to turn a general Reset Petri net into a-bisimilar normalized Reset Petri net. Our normalization preserves the main usually studied properties : Boundedness, Reachability, t-Liveness and Language (through a-labeling function). The main contribution is the improvement of the complexity : our algorithm takes a time in O(size(N) 2), for a Reset Petri net N, while other known normalizations require an exponential space and are presented for Petri nets only.